Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

We prove that the bicriteria single-machine scheduling problem of minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Our result settles a long-standing open problem.

Fast fully polynomial approximation schemes for minimizing completion time variance

We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these schemes runs in time O(n/ ) and thus improves on all fully polynomial approximation schemes presented in the literature.

Company ON MINIMIZING TOTAL COMPLETION TIME IN BATCHMACHINE SCHEDULING

Minimizing Total Flow Time and Total Completion Time with Immediate Dispat hing

Single Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost

In this paper, the authors consider a single machine scheduling problem with rejection. In traditional research, it is assumed all jobs must be processed. However, in the real-world situation, certain jobs can be rejected. In this study, the jobs can be either accepted and scheduled or be rejected at the cost of a penalty. Two objective functions are considered simultaneously: (1) minimization ...